Simulation of a turbulent premixed open V-shaped flame using contour advection with surgery

Despite its capability of high spatial resolution, simulation of turbulent flows with traditional Lagrangian (front tracking) scheme is often discouraged by numerical instability caused by clustering of marker nodes and topological changes of fronts. Contour advection surgery (CAS), being a robust front tracking scheme, can limit the growth of front complexity during simulation without jeopardizing accuracy or efficiency. This allows it to open up an advantage over traditional front-tracking schemes. It has already been demonstrated that CAS, with incorporation of the reaction sheet model, can accurately simulate the propagation and advection of a turbulent premixed V-shaped flame. In this study, it is further tested with 10 values of vortex circulation. A range of upstream turbulence levels of 1.8–19.8% was obtained. Results indicate that upstream turbulence increase the average flame length, flame zone area and the overall burning rate. Flame surface density Σ was also estimated. Maximum values of Σ obtained lie in the range 0.1–1.4 mm⁻¹. Skewness towards the burnt region was observed in all profiles of Σ. Similar to results from laboratory experiments, it was found that Σ values decreases with upstream turbulence. From this study, the ability of CAS to cope with intense turbulence is demonstrated and a better quantitative understanding on the scheme has also been acquired.     

Dual frames in connected with generalized sampling in shift-invariant spaces

The aim of this article is to derive stable generalized sampling in a shift-invariant space by using some special dual frames in L²(0,1). These sampling formulas involve samples of filtered versions of the functions in the shift-invariant space. The involved samples are expressed as the frame coefficients of an appropriate function in L²(0,1) with respect to some particular frame in L²(0,1). Since any shift-invariant space with stable generator is the image of L²(0,1) by means of a bounded invertible operator, our generalized sampling is derived from some dual frame expansions in L²(0,1).     

Au deposits on graphite: On the nature of high temperature desorption peaks in CO thermal desorption spectra

Due to the discovery of Au as a catalyst for low temperature CO oxidation, the adsorption of CO on Au surfaces has attracted a lot of attention recently. On stepped and rough single crystal surfaces as well as on deposited particles two characteristic desorption states above 100 K have been observed via TPD. We have studied Au deposits on graphite in order to elucidate the nature of these desorption peaks in more detail. For this purpose, Au was deposited at 100 K and 300 K on HOPG as a weakly interacting support. In analogy to other supports, we obtain two desorption states (∼140 K and ∼170 K) whose relative intensities depend strongly on the deposition temperature with the high temperature peak being much more pronounced for the 100 K deposits. After annealing to 600 K, both states drastically lose intensity. XP spectra, on the other hand, show virtually no decrease of the Au 4f intensity as would be expected for desorption or significant changes of the particle morphologies. We conclude that both desorption peaks are defect-related and connected with under-coordinated Au atoms that are lost for the most part upon annealing. These sites could be located at the perimeter of dendritic islands or on small, defect-rich particles in addition to larger particles not adsorbing CO at 100 K. Preliminary STM results are in favour of the second interpretation.     

Differential algebraic equations with after-effect

In this paper, we are concerned with the solution of delay differential algebraic equations. These are differential algebraic equations with after-effect, or constrained delay differential equations. The general semi-explicit form of the problem consists of a set of delay differential equations combined with a set of constraints that may involve retarded arguments. Even simply stated problems of this type can give rise to difficult analytical and numerical problems. The more tractable examples can be shown to be equivalent to systems of delay or neutral delay differential equations. Our purpose is to highlight some of the complexities and obstacles that can arise when solving these problems, and to indicate problems that require further research.     

Local search algorithms for the min-max loop layout problem

In the min-max loop layout problem, machines are to be arranged around a loop of conveyor belt. The ordering of the machines dictates the number of circuits of the conveyor belt required to manufacture each of several products. The goal is to find an ordering of the machines that minimises the maximum number of circuits required for the manufacture of any of the products. Since the problem is strongly NP-hard, the study of heuristic methods is of interest. This paper proposes iterated descent and tabu search algorithms, and a randomised insertion algorithm. Results of extensive computational tests show that all of our algorithms outperform a previously known algorithm that applies a greedy heuristic to the solution of a linear programming relaxation. The best quality solutions are obtained with iterated descent. This adds further evidence to the belief that iterated descent can produce high quality solutions to a variety of combinatorial optimisation problems. Moreover, unlike some other local search algorithms, iterated descent does not require much tuning in order to be competitive.     

Recent trends in optical data processing

Optical data processing is an advancing field which has received much attention in recent years. Optical techniques have already shown their applicability in target identification, advanced signal processing operations and advanced linear algebra operations. The potential capabilities of processing of data using photons instead of electrons as the carrier of information have established, beyond any doubt, that the optical techniques will be the next generation technology surpassing electronic techniques in some important areas such as air traffic control, missile guidance and remote sensing. Although great strides have been made in all the areas of optical data processing, the goal of high performance, high speed and very accurate all-optical computers would be realised only around the year 1995. The main difficulty is that the required materials for high resolution and fast spatial light modulators and optical interconnects are yet to be perfected. The present paper reviews the recent trends and the future prospects of optical data processing.     

Toward phenanthridin-2-ylidene: electrophilicity versus acidity in planar-constrained C-aryl iminium salts

A phenanthridinium salt was prepared in four steps, including an intramolecular CH-arylation and a hydride abstraction reaction. Treatment with sterically demanding bases does not lead to the corresponding carbene, but rather to addition products: the planar-constrained geometry significantly enhances the electrophilicity over the acidity of C-aryl iminium salts.     

The α-arylation of α-bromo- and α-chloroenones using palladium-catalysed cross-coupling

The palladium-catalysed cross-coupling reaction of various arylboronic acids with α-bromoenones and α-chloroenones offers an operationally simple approach to the synthesis of both cyclic and acyclic α-arylenones.     

On the treatment of the pairing interaction in the particle-rotor model

Different ways of treating the pairing interaction in the particle-rotor model are discussed and compared in a model which can be solved exactly. Special attention is paid to the interaction between the yrast and yrare bands as function of the shell filling.     

A result on sets,with applications to vector optimization

In this paper there is stated a result on sets in ordered linear spaces which can be used to show that some properties of the sets are inherited by their convex hulls under suitable conditions. As applications one gives a characterization of weakly efficient points and a duality result for nonconvex vector optimization problems.